0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.13/0.12 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.13/0.33 % Computer : n014.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Jul 13 14:56:04 EDT 2021 0.13/0.34 % CPUTime : 0.20/0.34 % Number of cores: 8 0.20/0.34 % Python version: Python 3.6.8 0.20/0.34 # Version: 2.6rc1-ho 0.20/0.34 # No SInE strategy applied 0.20/0.34 # Trying AutoSched0 for 59 seconds 0.20/0.37 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN 0.20/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. 0.20/0.37 # 0.20/0.37 # Preprocessing time : 0.027 s 0.20/0.37 # Presaturation interreduction done 0.20/0.37 0.20/0.37 # Proof found! 0.20/0.37 # SZS status Theorem 0.20/0.37 # SZS output start CNFRefutation 0.20/0.37 thf(satz25, conjecture, (~(~(![X1:nat]:(y)!=(pl @ (pl @ x @ n_1) @ X1)))=>(y)=(pl @ x @ n_1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz25)). 0.20/0.37 thf(satz19a, axiom, ![X2:nat, X3:nat, X4:nat]:(~(![X1:nat]:(pl @ X2 @ X4)!=(pl @ (pl @ X3 @ X4) @ X1))<=~(![X1:nat]:(X2)!=(pl @ X3 @ X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz19a)). 0.20/0.37 thf(satz6, axiom, ![X2:nat, X3:nat]:(pl @ X2 @ X3)=(pl @ X3 @ X2), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz6)). 0.20/0.37 thf(satz24, axiom, ![X2:nat]:(~(~(![X1:nat]:(X2)!=(pl @ n_1 @ X1)))=>(X2)=(n_1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz24)). 0.20/0.37 thf(m, axiom, ~(![X1:nat]:(y)!=(pl @ x @ X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', m)). 0.20/0.37 thf(c_0_5, negated_conjecture, ~((~(~(![X1:nat]:(y)!=(pl @ (pl @ x @ n_1) @ X1)))=>(y)=(pl @ x @ n_1))), inference(assume_negation,[status(cth)],[satz25])). 0.20/0.37 thf(c_0_6, plain, ![X2:nat, X3:nat, X4:nat]:(~(![X1:nat]:(X2)!=(pl @ X3 @ X1))=>~(![X1:nat]:(pl @ X2 @ X4)!=(pl @ (pl @ X3 @ X4) @ X1))), inference(fof_simplification,[status(thm)],[satz19a])). 0.20/0.37 thf(c_0_7, negated_conjecture, ![X24:nat]:((y)!=(pl @ (pl @ x @ n_1) @ X24)&(y)!=(pl @ x @ n_1)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])). 0.20/0.37 thf(c_0_8, plain, ![X25:nat, X26:nat]:(pl @ X25 @ X26)=(pl @ X26 @ X25), inference(variable_rename,[status(thm)],[satz6])). 0.20/0.37 thf(c_0_9, plain, ![X19:nat, X20:nat, X21:nat, X22:nat]:((X19)!=(pl @ X20 @ X21)|(pl @ X19 @ X22)=(pl @ (pl @ X20 @ X22) @ (esk2_3 @ X19 @ X20 @ X22))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])). 0.20/0.37 thf(c_0_10, negated_conjecture, ![X1:nat]:(y)!=(pl @ (pl @ x @ n_1) @ X1), inference(split_conjunct,[status(thm)],[c_0_7])). 0.20/0.37 thf(c_0_11, plain, ![X2:nat, X1:nat]:(pl @ X1 @ X2)=(pl @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_8])). 0.20/0.37 thf(c_0_12, plain, ![X1:nat, X2:nat, X4:nat, X3:nat]:((pl @ X1 @ X4)=(pl @ (pl @ X2 @ X4) @ (esk2_3 @ X1 @ X2 @ X4))|(X1)!=(pl @ X2 @ X3)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.20/0.37 thf(c_0_13, negated_conjecture, ![X1:nat]:(pl @ (pl @ n_1 @ x) @ X1)!=(y), inference(rw,[status(thm)],[c_0_10, c_0_11])). 0.20/0.37 thf(c_0_14, plain, ![X1:nat, X3:nat, X2:nat]:(pl @ (pl @ X1 @ X2) @ (esk2_3 @ (pl @ X1 @ X3) @ X1 @ X2))=(pl @ (pl @ X1 @ X3) @ X2), inference(er,[status(thm)],[c_0_12])). 0.20/0.37 thf(c_0_15, plain, ![X27:nat]:((X27)=(pl @ n_1 @ (esk3_1 @ X27))|(X27)=(n_1)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz24])])])). 0.20/0.37 thf(c_0_16, negated_conjecture, ![X1:nat]:(pl @ x @ (pl @ n_1 @ X1))!=(y), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_11])). 0.20/0.37 thf(c_0_17, plain, ![X1:nat]:((X1)=(pl @ n_1 @ (esk3_1 @ X1))|(X1)=(n_1)), inference(split_conjunct,[status(thm)],[c_0_15])). 0.20/0.37 thf(c_0_18, plain, (y)=(pl @ x @ esk1_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m])])])). 0.20/0.37 thf(c_0_19, negated_conjecture, ![X1:nat]:((X1)=(n_1)|(pl @ x @ X1)!=(y)), inference(spm,[status(thm)],[c_0_16, c_0_17])). 0.20/0.37 thf(c_0_20, plain, (y)=(pl @ x @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_18])). 0.20/0.37 thf(c_0_21, negated_conjecture, (y)!=(pl @ x @ n_1), inference(split_conjunct,[status(thm)],[c_0_7])). 0.20/0.37 thf(c_0_22, negated_conjecture, (esk1_0)=(n_1), inference(spm,[status(thm)],[c_0_19, c_0_20])). 0.20/0.37 thf(c_0_23, negated_conjecture, (pl @ n_1 @ x)!=(y), inference(rw,[status(thm)],[c_0_21, c_0_11])). 0.20/0.37 thf(c_0_24, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20, c_0_22]), c_0_11]), c_0_23]), ['proof']). 0.20/0.37 # SZS output end CNFRefutation 0.20/0.37 # Proof object total steps : 25 0.20/0.37 # Proof object clause steps : 13 0.20/0.37 # Proof object formula steps : 12 0.20/0.37 # Proof object conjectures : 10 0.20/0.37 # Proof object clause conjectures : 7 0.20/0.37 # Proof object formula conjectures : 3 0.20/0.37 # Proof object initial clauses used : 6 0.20/0.37 # Proof object initial formulas used : 5 0.20/0.37 # Proof object generating inferences : 3 0.20/0.37 # Proof object simplifying inferences : 7 0.20/0.37 # Training examples: 0 positive, 0 negative 0.20/0.37 # Parsed axioms : 11 0.20/0.37 # Removed by relevancy pruning/SinE : 0 0.20/0.37 # Initial clauses : 12 0.20/0.37 # Removed in clause preprocessing : 6 0.20/0.37 # Initial clauses in saturation : 6 0.20/0.37 # Processed clauses : 27 0.20/0.37 # ...of these trivial : 0 0.20/0.37 # ...subsumed : 6 0.20/0.37 # ...remaining for further processing : 21 0.20/0.37 # Other redundant clauses eliminated : 1 0.20/0.37 # Clauses deleted for lack of memory : 0 0.20/0.37 # Backward-subsumed : 0 0.20/0.37 # Backward-rewritten : 3 0.20/0.37 # Generated clauses : 29 0.20/0.37 # ...of the previous two non-trivial : 31 0.20/0.37 # Contextual simplify-reflections : 0 0.20/0.37 # Paramodulations : 28 0.20/0.37 # Factorizations : 0 0.20/0.37 # NegExts : 0 0.20/0.37 # Equation resolutions : 1 0.20/0.37 # Propositional unsat checks : 0 0.20/0.37 # Propositional check models : 0 0.20/0.37 # Propositional check unsatisfiable : 0 0.20/0.37 # Propositional clauses : 0 0.20/0.37 # Propositional clauses after purity: 0 0.20/0.37 # Propositional unsat core size : 0 0.20/0.37 # Propositional preprocessing time : 0.000 0.20/0.37 # Propositional encoding time : 0.000 0.20/0.37 # Propositional solver time : 0.000 0.20/0.37 # Success case prop preproc time : 0.000 0.20/0.37 # Success case prop encoding time : 0.000 0.20/0.37 # Success case prop solver time : 0.000 0.20/0.37 # Current number of processed clauses : 11 0.20/0.37 # Positive orientable unit clauses : 3 0.20/0.37 # Positive unorientable unit clauses: 1 0.20/0.37 # Negative unit clauses : 5 0.20/0.37 # Non-unit-clauses : 2 0.20/0.37 # Current number of unprocessed clauses: 16 0.20/0.37 # ...number of literals in the above : 20 0.20/0.37 # Current number of archived formulas : 0 0.20/0.37 # Current number of archived clauses : 9 0.20/0.37 # Clause-clause subsumption calls (NU) : 0 0.20/0.37 # Rec. Clause-clause subsumption calls : 0 0.20/0.37 # Non-unit clause-clause subsumptions : 0 0.20/0.37 # Unit Clause-clause subsumption calls : 7 0.20/0.37 # Rewrite failures with RHS unbound : 0 0.20/0.37 # BW rewrite match attempts : 17 0.20/0.37 # BW rewrite match successes : 17 0.20/0.37 # Condensation attempts : 0 0.20/0.37 # Condensation successes : 0 0.20/0.37 # Termbank termtop insertions : 833 0.20/0.37 0.20/0.37 # ------------------------------------------------- 0.20/0.37 # User time : 0.028 s 0.20/0.37 # System time : 0.004 s 0.20/0.37 # Total time : 0.032 s 0.20/0.37 # Maximum resident set size: 1648 pages 0.20/0.37 EOF